Toward the Synthesis of Constraint Solvers
نویسندگان
چکیده
We develop a basic mathematical framework for specifying and formally designing highperformance constraint solving algorithms. The framework is based on concepts from abstract interpretation which generalizes earlier work on a Galois Connection-based model of Global Search algorithms. The main focus is on how to use the framework to automate the calculations necessary to construct a correct, high-performance solver. We present here the foundations for generating customized/native solvers for specified constraint satisfaction problems. Our thesis is that a native solver can always be generated for a constraint problem that outperforms a reduction to an existing solver.
منابع مشابه
On Sequential Optimality Conditions without Constraint Qualifications for Nonlinear Programming with Nonsmooth Convex Objective Functions
Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Here, nonsmooth approximate gradient projection and complementary approximate Karush-Kuhn-Tucker conditions are presented. These sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constrai...
متن کامل(Quantified) Horn Constraint Solving for Program Verification and Synthesis
We show how automatic tools for the verification of linear and branching time properties of procedural, multi-threaded, and functional programs as well as program synthesis can be naturally and uniformly seen as solvers of constraints in form of (quantified) Horn clauses over background logical theories. Such a perspective can offer various advantages, e. g., a logical separation of concerns be...
متن کاملProgram Synthesis for Hierarchical Specifications
Synthesis is the problem of obtaining programs from relational specifications. We present grammar-modular (GM) synthesis, an algorithm for synthesis from tree-structured relational specifications. GM synthesis makes synthesis applicable to previously intractable relational specifications by decomposing them into smaller subproblems, which can be tackled in isolation by off-the-shelf synthesis p...
متن کاملModelling Constraint Solver Architecture Design as a Constraint Problem
Designing component-based constraint solvers is a complex problem. Some components are required, some are optional and there are interdependencies between the components. Because of this, previous approaches to solver design and modification have been ad-hoc and limited. We present a system that transforms a description of the components and the characteristics of the target constraint solver i...
متن کاملToward Adaptive Cooperation between Global and Local Solvers for Continuous Constraint Problems
Search methods for solving continuous constraint problems can be broadly divided into two categories: global search and local search methods. Global search methods spend a great amount of effort exploring the global search space, whereas local search methods focus on converging to local optimal solutions. Although these methods alone work well on many problems, there are many others that will b...
متن کامل